Computer discovery and analysis of large Poisson polynomials David H. Bailey∗ Jonathan M. Borwein† Jason S. Kimberley‡

Source URL: www.davidhbailey.com

• Polynomials
• Mathematics
• Algebra
• Integer relation algorithm
• Factorization of polynomials
• Polynomial
• Factorization
• Minimal polynomial
• Experimental mathematics
• Polynomial greatest common divisor

RIGOROUS UNIFORM APPROXIMATION OF D-FINITE FUNCTIONS USING CHEBYSHEV EXPANSIONS ALEXANDRE BENOIT, MIOARA JOLDES, AND MARC MEZZAROBBA Abstract. A wide range of numerical methods exists for computing polynomial approximati

Source URL: www.marc.mezzarobba.net

• Algebra
• Orthogonal polynomials
• Elementary algebra
• Numerical analysis
• Approximation theory
• Chebyshev polynomials
• Polynomial
• Recurrence relation
• Holonomic function
• Minimax approximation algorithm
• Rational function
• Factorization

J. Symbolic Computation, 351–369 Lattices of Compatibly Embedded Finite Fields† WIEB BOSMA‡, JOHN CANNON§ AND ALLAN STEEL¶ Computational Algebra Group, School of Mathematics and Statistics, The Univers

Source URL: www.math.ru.nl

• Field theory
• Polynomials
• Computer algebra
• Finite fields
• Abstract algebra
• Conway polynomial
• Field
• Minimal polynomial
• Embedding
• Model theory
• Factorization of polynomials
• Duality

From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition Kurt Mehlhorn Max Planck Institute for Informatics, Saarbr¨ucken, Germany

Source URL: people.mpi-inf.mpg.de

• Mathematics
• Algebra
• Polynomials
• Computer algebra
• Root-finding algorithms
• Factorization of polynomials
• Factorization
• Splitting circle method
• Polynomial
• Resultant
• Multiplicity
• Factorial

Factorization of Univariate Polynomials with Rational Coefficients Andrew Novocin & Mark van Hoeij Department of Mathematics, Florida State University The r3 Algorithm:

Source URL: andy.novocin.com

VOLUME 43, NUMBER 3 FALL 2014 California Mathematics Council Community Colleges

Source URL: www.cmc3.org

• Sacramento metropolitan area
• Polynomials
• Geography of the United States
• Arithmetic
• Factorization
• Completing the square
• Coefficient
• Sacramento
• California
• Lake Tahoe
• Mathematics
• Algebra
• Geography of California

Approximation Algorithms for Projective Clustering  Pankaj K. Agarwalz y Cecilia M. Procopiuc z

Source URL: www.cs.duke.edu

• Analysis of algorithms
• Probabilistic complexity theory
• Randomized algorithm
• Factorial
• Factorization of polynomials over a finite field and irreducibility tests
• Euclidean algorithm
• Mathematics
• Combinatorics
• Number theory

Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme P. Delsarte Philips Research Laboratory, Avenue Van Becelaere, 2 B-1170 Brussels, Belgium Y. Desmedt

Source URL: www.dtc.umn.edu

• Cryptography
• Finite fields
• Public-key cryptography
• Euclidean algorithm
• Factorization of polynomials over a finite field and irreducibility tests
• Mathematics
• Mathematical analysis
• Polynomials

Department of Mathematics Texas A&M University 3368 TAMU College Station, TXF

Source URL: see-math.math.tamu.edu

• Computational number theory
• Cryptography
• Factorization of polynomials over a finite field and irreducibility tests
• Polynomials
• Anatolii Alexeevitch Karatsuba
• Mathematics
• Algebra
• Coding theory

Square Root Algorithms for the Number Field Sieve Emmanuel Thomé INRIA Nancy, Villers-lès-Nancy, France Abstract. We review several methods for the square root step of the

Source URL: www.loria.fr

• Integer factorization algorithms
• Polynomials
• Field theory
• Algebraic number theory
• General number field sieve
• Special number field sieve
• Algebraic number field
• Elliptic curve
• Prime number
• Abstract algebra
• Mathematics
• Algebra